Multi-point Constructive Search
نویسنده
چکیده
Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting search from an elite solution. Empirical results indicate that for job shop scheduling optimization problems and quasi-group completion problems, multi-point constructive search performs significantly better than chronological backtracking and bounded backtracking with random restart.
منابع مشابه
Multi-Point Constructive Search: Extended Remix
Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting search from an elite solution. Empirical results indicate that for job shop scheduling optimization problems, multi-point constructive search leads to significantly better solutions for equivalent search effort when compared to chron...
متن کاملSolution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins either from an empty solution (as in randomized restart) or from a solution that has been encountered during the search. A small number of these “elite” solutions is maintained during the search. We introduce the tech...
متن کاملAn Empirical Study of Multi-Point Constructive Search for Constraint Satisfaction
Multi-Point Constructive Search (MPCS) is a constructive search technique which borrows the idea from local search of being guided by multiple viewpoints. MPCS consists of a series of resource-limited backtracking searches: each starting from an empty solution or guided by one of a set of high quality, “elite” solutions encountered earlier in the search. This paper focuses on MPCS as applied to...
متن کاملAn Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling
Multi-point constructive search (MPCS) performs a series of resource-limited backtracking searches where each search begins either from an empty solution (as in randomized restart) or from a solution that has been encountered during the search. We perform a systematic study of MPCS to evaluate the performance impact of various parameter settings. Results using job shop scheduling instances with...
متن کاملHeuristics and metaheuristics in forward-chaining planning
Forward-chaining heuristic search is a well-established and popular paradigm for planning. It is, however, characterised by two key weaknesses. First, search is guided by a domain-independent heuristic which although applicable in a wide range of domains, can often give poor guidance. Second, the metaheuristics used to control forward-chaining planning are often weak, using simple local-search ...
متن کامل